A Multi-population Based Frog-memetic Algorithm for Job Shop Scheduling Problem
نویسندگان
چکیده
The Job Shop Scheduling Problem (JSSP) is a well known practical planning problem in the manufacturing sector. We have considered the JSSP with an objective of minimizing makespan. In this paper, we develop a three-stage hybrid approach called JSFMA to solve the JSSP. In JSFMA, considering a method similar to Shuffled Frog Leaping algorithm we divide the population in several sub populations and then solve the problem using a Memetic algorithm. The proposed approach have been compared with other algorithms for the Job Shop Scheduling and evaluated with satisfactory results on a set of the JSSP instances derived from classical Job Shop Scheduling benchmarks. We have solved 20 benchmark problems from Lawrence’s datasets and compared the results obtained with the results of the algorithms established in the literature. The experimental results show that JSFMA could gain the best known makespan in 17 out of 20 problems.
منابع مشابه
Critical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کامل